A Preconditioned Scheme for Nonsymmetric Saddle-Point Problems
نویسنده
چکیده
In this paper, we present an effective preconditioning technique for solving nonsymmetric saddle-point problems. In particular, we consider those saddlepoint problems that arise in the numerical simulation of particulate flows—flow of solid particles in incompressible fluids, using mixed finite element discretization of the Navier–Stokes equations. These indefinite linear systems are solved using a preconditioned Krylov subspace method with an indefinite preconditioner. This creates an inner–outer iteration, in which the inner iteration is handled via a preconditioned Richardson scheme. We provide an analysis of our approach that relates the convergence properties of the inner to the outer iterations. Also “optimal” approaches are proposed for the implicit construction of the Richardson’s iteration preconditioner. The analysis is validated by numerical experiments that demonstrate the robustness of our scheme, its lack of sensitivity to changes in the fluid–particle system, and its “scalability”.
منابع مشابه
On the eigenvalues and eigenvectors of nonsymmetric saddle point matrices preconditioned by block triangular matrices
Block lower triangular and block upper triangular matrices are popular preconditioners for nonsymmetric saddle point matrices. In this note we show that a block lower triangular preconditioner gives the same spectrum as a block upper triangular preconditioner and that the eigenvectors of the two preconditioned systems are related. Nonsingular saddle point matrices of the form
متن کاملAn Augmentation Preconditioner for Asymmetric Saddle Point Problems with Singular (1,1) Blocks
Abstract In this paper, an augmentation preconditioner for asymmetric saddle point problems with singular (1,1) blocks is introduced on the base of the recent article by He and Huang [Two augmentation preconditioners for nonsymmetric and indefinite saddle point linear systems with singular (1, 1) blocks, Comput. Math. Appl., 62 (2011) 87-92]. We study the spectral characteristics of the precond...
متن کاملSymmetric part preconditioning of the CGM for Stokes type saddle-point systems
Saddle-point problems arise as mathematical models in various applications and have been a subject of intense investigation, e.g. [5, 11, 23, 26]. Besides the widespread Uzawa type methods, an efficient way of solving such problems is the preconditioned conjugate gradient method. In this paper we consider nonsymmetric formulations of saddle-point systems, following [12]. For nonsymmetric proble...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملPreconditioners for Generalized Saddle-Point Problems
We propose and examine block-diagonal preconditioners and variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. That is, we consider the nonsymmetric, nonsingular case where the (2,2) block is small in norm, and we are particularly concerned with the case where the (1,2) block is different from the transposed (2,1) block. We provide theoretical and exper...
متن کامل